Proceedings Workshop on Partiality and Recursion in Interactive Theorem Provers
نویسندگان
چکیده
منابع مشابه
Partiality and recursion in interactive theorem provers - an overview
The use of interactive theorem provers to establish the correctness of critical parts of a software development or for formalising mathematics is becoming more common and feasible in practice. However, most mature theorem provers lack a direct treatment of partial and general recursive functions; overcoming this weakness has been the objective of intensive research during the last decades. In t...
متن کاملTrusted Extensions of Interactive Theorem Provers: Workshop Summary
A fundamental strength of interactive theorem provers (ITPs) is the high degree of trust one can place in formalizations carried out in them. ITPs are usually also extensible, both at the logic level and at the implementation level. There is consequently a substantial body of existing and ongoing research into the extension of ITPs while preserving trust. In order to survey existing and new wor...
متن کاملExploiting Parallelism in Interactive Theorem Provers
This paper reports on the implementation and analysis of the MP reener, the rst parallel interactive theorem prover. The MP reener is a shared memory multi-processor implementation of the inference engine of Nuprl. The inference engine of Nuprl is called the reener. The MP reener is a collection of threads operating as sequential reeners running on separate processors. Concurrent tactics exploi...
متن کاملPartiality and Recursion in Higher-Order Logic
We present an illative system Is of classical higher-order logic with subtyping and basic inductive types. The system Is allows for direct definitions of partial and general recursive functions, and provides means for handling functions whose termination has not been proven. We give examples of how properties of some recursive functions may be established in our system. In a technical appendix ...
متن کاملDependency Graphs for Interactive Theorem Provers
We propose tools to visualize large proof developments as graphs of theorems and deenitions where edges denote the dependency between two theorems. In particular, we study means to limit the size of graphs. Experiments have been done with the Coq theorem prover DFH + 93] and the GraphViz EGKN] and daVinci FW98] graph visualization suites.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2010
ISSN: 2075-2180
DOI: 10.4204/eptcs.43.0